Prime numbers and quadratic polynomials
نویسنده
چکیده
Some nonconstant polynomials with a finite string of prime values are known; in this paper, some polynomials of this kind are described, starting from Euler’s example (1772) P(x) = x2+x+41: other quadratic polynomials with prime values were studied, and their properties were related to properties of quadratic fields; in this paper, some quadratic polynomials with prime values are described and studied.
منابع مشابه
Quintic Polynomials and Real Cyclotomic Fields with Large Class Numbers
We study a family of quintic polynomials discoverd by Emma Lehmer. We show that the roots are fundamental units for the corresponding quintic fields. These fields have large class numbers and several examples are calculated. As a consequence, we show that for the prime p = 641491 the class number of the maximal real subfield of the pth cyclotomic field is divisible by the prime 1566401. In an a...
متن کاملNew quadratic polynomials with high densities of prime values
Hardy and Littlewood’s Conjecture F implies that the asymptotic density of prime values of the polynomials fA(x) = x 2 + x + A, A ∈ Z, is related to the discriminant ∆ = 1 − 4A of fA(x) via a quantity C(∆). The larger C(∆) is, the higher the asymptotic density of prime values for any quadratic polynomial of discriminant ∆. A technique of Bach allows one to estimate C(∆) accurately for any ∆ < 0...
متن کاملOn almost universal ternary inhomogeneous quadratic polynomials
A fundamental question in the study of integral quadratic forms is the representation problem which asks for an effective determination of the set of integers represented by a given quadratic form. A related and equally interesting problem is the representation of integers by inhomogeneous quadratic polynomials. An inhomogeneous quadratic polynomial is a sum of a quadratic form and a linear for...
متن کاملPredicting Prime Numbers Using Cartesian Genetic Programming
Prime generating polynomial functions are known that can produce sequences of prime numbers (e.g. Euler polynomials). However, polynomials which produce consecutive prime numbers are much more difficult to obtain. In this paper, we propose approaches for both these problems. The first uses Cartesian Genetic Programming (CGP) to directly evolve integer based prime-prediction mathematical formula...
متن کاملNew Prime-Producing Quadratic Polynomials Associated with Class Number One or Two
This article provides necessary and sufficient conditions for a real quadratic field to have class number one or two in terms of a new set of primeproducing quadratic polynomials
متن کامل